package writtenTraining.day17;

import java.util.*;
import java.io.*;
/**
 * day17:(1)模拟：BC45 小乐乐改数字
 */

public class Main {
    public static void main(String[] args) {
        // 模拟


        // 输入数据
        Scanner in = new Scanner(System.in);
        long num = in.nextLong();

        // 转化为字符串操作
        String str = Long.toString(num);

        // 模拟转换
        long ret  = 0;
        int len = str.length();
        for(int i = 0; i < len; i++) {
            if(str.charAt(i) % 2 == 0) {
                // 偶数就加上 0 
                ret = ret * 10 + 0;
            } else {
                // 奇数就加上 1 
                ret = ret * 10 + 1;
            }
        }

        // 输出结果
        System.out.println(ret);
    }
}

/**
 * day17:(2)预处理+模拟：十字爆破
 */


 class Main1 {
    public static void main(String[] args) throws IOException{
        // 预处理 + 模拟

        // 输入数据
        PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
        Read in = new Read();
//         Scanner in = new Scanner(System.in);
        int n = in.nextInt(), m = in.nextInt();
        int[][] nums = new int[n][m];
        long[] row = new long[n];
        long[] col = new long[m];
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < m; j++) {
                int num = in.nextInt();
//                 统计横行
                row[i] += num;
                nums[i][j] = num;
            }
        }

        for(int j = 0; j < m; j++) {
            for(int i = 0 ; i < n; i++) {
//                 统计纵行
                col[j] += nums[i][j];
            }
        }

//         获取结果
//         int[][] ret = new int[n][m];
        for(int i =0; i < n; i++) {
            for(int j = 0; j < m - 1; j++) {
//         输出结果
                out.print(row[i] + col[j] - nums[i][j] + " ");
            }
            out.println(row[i] + col[m - 1] - nums[i][m - 1]);
        }

        out.close();
    }
}

class Read // 自定义快速读入
{
    StringTokenizer st = new StringTokenizer("");
    BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
    String next() throws IOException
    {
        while(!st.hasMoreTokens())
        {
            st = new StringTokenizer(bf.readLine());
        }
        return st.nextToken();
    }

    String nextLine() throws IOException
    {
        return bf.readLine();
    }

    int nextInt() throws IOException
    {
        return Integer.parseInt(next());
    }

    long nextLong() throws IOException
    {
        return Long.parseLong(next());
    }

    double nextDouble() throws IOException
    {
        return Double.parseDouble(next());
    }
}


/**
 * day17:(3)前缀和：比那名居的桃子
 */


 class Main2 {
    public static void main(String[] args) {
        // 前缀和

        // 输入数据
        Scanner in = new Scanner(System.in);
        int n = in.nextInt(), k = in.nextInt();
        long[] happy = new long[n+1];
        long[] shy = new long[n+1];
        long[][] mis = new long[2][n];
        long maxhappy  = 0L , minShy = 0L;

        for(int i =0; i < n; i++) {
            mis[0][i] = in.nextInt();
        }
        for (int i = 0; i < n; i++) {
            mis[1][i] = in.nextInt();
        }

        // 统计快乐值前缀和 和 统计羞耻度前缀和
        for(int i = n - 1; i >= 0; i--) {

            happy[i] = happy[i+1] + mis[0][i];
            shy[i] = shy[i+1] + mis[1][i];
        }


//         从后往前遍历
        int ret = 0;
        for(int i = n - 1; i >= 0; i--) {
//             先得到快乐值
            long hap = 0L;
//                 获取羞耻度
            long sh = 0L;
            if(i + k >= n) {
//                 防止越界
                hap = happy[i];
                sh = shy[i];
            } else {
                hap = happy[i] - happy[i + k];
                sh = shy[i] - shy[i+k];
            }

//             比较快乐值
            if(hap > maxhappy) {
//                 快乐值更大
                ret = i + 1;
                maxhappy = hap;
                minShy = sh;
            } else if(hap == maxhappy) {
//                 快乐值想等
//                 于是就需要比较羞耻度
                if(sh < minShy) {
                    maxhappy = hap;
                    minShy = sh;
                    ret = i + 1;
                } else if(sh == minShy) {
                    ret = i + 1;
                }

            }
        }

//         输出结果
        System.out.println(ret);
    }
}